Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
نویسندگان
چکیده
We show that arbitrary convergence behavior of Ritz values is possible in the Arnoldi method and we give two parametrizations of the class of matrices with initial Arnoldi vectors that generates prescribed Ritz values (in all iterations). The second parametrization enables us to prove that any GMRES residual norm history is possible with any prescribed Ritz values (in all iterations), provided we treat the stagnation case appropriately.
منابع مشابه
Restarted GMRES method Augmented with the Combination of Harmonic Ritz Vectors and Error Approximations
Restarted GMRES methods augmented with approximate eigenvectors are widely used for solving large sparse linear systems. Recently a new scheme of augmenting with error approximations is proposed. The main aim of this paper is to develop a restarted GMRES method augmented with the combination of harmonic Ritz vectors and error approximations. We demonstrate that the resulted combination method c...
متن کاملImplicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
The generalized minimum residual method (GMRES) is well known for solving large nonsymmetric systems of linear equations. It generally uses restarting, which slows the convergence. However, some information can be retained at the time of the restart and used in the next cycle. We present algorithms that use implicit restarting in order to retain this information. Approximate eigenvectors determ...
متن کاملGMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
The GMRES and Arnoldi algorithms, which reduce to the CR and Lanczos algorithms in the symmetric case, both minimize p(A)b over polynomials p of degree n. The difference is that p is normalized at z 0 for GMRES and at z x for Arnoldi. Analogous "ideal GMRES" and "ideal Arnoldi" problems are obtained if one removes b from the discussion and minimizes p(/l)II instead. Investigation of these true ...
متن کاملRICE UNIVERSITY Ritz Values and Arnoldi Convergence for Nonsymmetric Matrices
Ritz Values and Arnoldi Convergence for Nonsymmetric Matrices by Russell Carden The restarted Arnoldi method, useful for determining a few desired eigenvalues of a matrix, employs shifts to refine eigenvalue estimates. In the symmetric case, using selected Ritz values as shifts produces convergence due to interlacing. For nonsymmetric matrices the behavior of Ritz values is insufficiently under...
متن کاملAn Arnoldi-type Algorithm for Computing Page Rank
We consider the problem of computing PageRank. The matrix involved is large and cannot be factored, and hence techniques based on matrix-vector products must be applied. A variant of the restarted refined Arnoldi method is proposed, which does not involve Ritz value computations. Numerical examples illustrate the performance and convergence behavior of the algorithm. AMS subject classification ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 33 شماره
صفحات -
تاریخ انتشار 2012